A surrogate merit function developed for structural weight optimization problems
نویسندگان
چکیده
Abstract In this paper, a surrogate merit function (SMF) is proposed to be evaluated instead of the traditional functions (i.e., penalized weight structure). The standard format conventional needs several expensive trial-and-error tuning processes enhance optimization convergence quality, retuning for different structural model configurations, and final manual local search in case converges infeasible vicinity global optimum. However, on other hand, SMF has no tunning factor but shows statistically stable performance models, directly outstanding feasible points, superior advantages such as reduced required iterations achieve convergence. words, new no-hassle one due its brilliant user-friendly application robust numerical results. might revolutionary step commercializing design real-world construction market.
منابع مشابه
Differential Evolution Assisted by Surrogate Models for Structural Optimization Problems
Differential evolution (DE) is a popular computational method used to solve optimization problems with several variants available in the literature. Here, the use of a similarity-based surrogate model is proposed in order to improve DE’s overall performance in computationally expensive problems. The offspring are generated by means of different variants, and only the best one, according to the ...
متن کاملAPPLICATION OF KRIGING METHOD IN SURROGATE MANAGEMENT FRAMEWORK FOR OPTIMIZATION PROBLEMS
In this paper, Kriging has been chosen as the method for surrogate construction. The basic idea behind Kriging is to use a weighted linear combination of known function values to predict a function value at a place where it is not known. Kriging attempts to determine the best combination of weights in order to minimize the error in the estimated function value. Because the actual function value...
متن کاملA Merit Function for Inequality Constrained Nonlinear Programming Problems
We consider the use of the sequential quadratic programming (SQP) technique for solving the inequality constrained minimization problem min x f(x) subject to: g i (x) 0; i = 1; : : :; m: SQP methods require the use of an auxiliary function, called a merit function or line-search function, for assessing the steps that are generated. We derive a merit function by adding slack variables to create ...
متن کاملINTRODUCTION AND DEVELOPMENT OF SURROGATE MANAGEMENT FRAMEWORK FOR SOLVING OPTIMIZATION PROBLEMS
In this paper, we have outlined the surrogate management framework for optimization of expensive functions. An initial simple iterative method which we call the “Strawman” method illustrates how surrogates can be incorporated into optimization to stand in for the most expensive function. These ideas are made rigorous by incorporating them into the framework of pattern search methods. The SMF al...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2022
ISSN: ['1433-7479', '1432-7643']
DOI: https://doi.org/10.1007/s00500-022-07453-6